A Non-adaptive Stochastic Local Search Algorithm for the CHeSC 2011 Competition
نویسندگان
چکیده
In this work, we present our submission for the Cross-domain Heuristic Search Challenge 2011. We implemented a stochastic local search algorithm that consists of several algorithm schemata that have been offline-tuned on four sample problem domains. The schemata are based on all families of low-level heuristics available in the framework used in the competition with the exception of crossover heuristics. Our algorithm goes through an initial phase that filters dominated low-level heuristics, followed by an algorithm schemata selection implemented in a race. The winning schemata is run for the remaining computation time. Our algorithm ranked seventh in the competition results. In this paper, we present the results obtained after a more careful tuning, and a different combination of algorithm schemata included in the final algorithm design. This improved version would rank fourth in the competition.
منابع مشابه
Hyper-Heuristic Based on Iterated Local Search Driven by Evolutionary Algorithm
This paper proposes an evolutionary-based iterative local search hyper-heuristic approach called Iterated Search Driven by Evolutionary Algorithm Hyper-Heuristic (ISEA). Two versions of this algorithm, ISEAchesc and ISEA-adaptive, that differ in the re-initialization scheme are presented. The performance of the two algorithms was experimentally evaluated on six hard optimization problems using ...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملUsing a new modified harmony search algorithm to solve multi-objective reactive power dispatch in deterministic and stochastic models
The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...
متن کاملDevelopment of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کاملA Robust Competitive Global Supply Chain Network Design under Disruption: The Case of Medical Device Industry
In this study, an optimization model is proposed to design a Global Supply Chain (GSC) for a medical device manufacturer under disruption in the presence of pre-existing competitors and price inelasticity of demand. Therefore, static competition between the distributors’ facilities to more efficiently gain a further share in market of Economic Cooperation Organization trade agreement (ECOTA) is...
متن کامل